Dominating Functions and Graphs
نویسندگان
چکیده
منابع مشابه
Incidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملEdge Dominating Functions of Quadratic Residue Cayley Graphs
The concept of edge domination is introduced by Mitchell and Hedetniemi [6]. Further results on edge domination are given in Arumugam and Velammal [2]. Functional generalization for vertex subsets has been studied extensively in literature [4, 5]. Cockayne and Mynhardt [3] have introduced that edge subsets may also be embedded into sets of functions and an analogous concept of convexity could a...
متن کاملBasic Minimal Total Dominating Functions of Quadratic Residue Cayley Graphs
Domination theory is an important branch of Graph Theory and has many applications in Engineering, Communication Networks and many others. Allan, R.B., and Laskar, R., [1,2], Cockayne, E.J.,and Hedetniemi, S.T., [3], Haynes, T.W., and Slater, J.S., [4], have studied various domination parameters of graphs. Graphs associated with certain arithmetic functions which are usually called arithmetic g...
متن کاملBasic Edge Dominating Functions of Quadratic Residue Cayley Graphs
Graph Theory has been realized as one of the most useful branches of Mathematics of recent origin, finding widest applications in all most all branches of sciences, social sciences, and engineering and computer science. Nathanson[8] was the pioneer in introducing the concepts of NumberTheory, particularly, the “Theory of congruences” i n Graph Theory, thus paving way for the emergence of a new ...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 1994
ISSN: 0024-6107
DOI: 10.1112/jlms/49.1.16